A Hybrid Bat Algorithm for Process Planning Problem
نویسندگان
چکیده
منابع مشابه
A hybrid bat algorithm
Iztok Fister Jr.,∗ Dušan Fister,† and Xin-She Yang‡ Abstract Swarm intelligence is a very powerful technique to be used for optimization purposes. In this paper we present a new swarm intelligence algorithm, based on the bat algorithm. The Bat algorithm is hybridized with differential evolution strategies. Besides showing very promising results of the standard benchmark functions, this hybridiz...
متن کاملA hybrid metaheuristic algorithm for the robust pollution-routing problem
Emissions resulted from transportation activities may lead to dangerous effects on the whole environment and human health. According to sustainability principles, in recent years researchers attempt to consider the environmental burden of logistics activities in traditional logistics problems such as vehicle routing problems (VRPs). The pollution-routing problem (PRP) is an extension of the VRP...
متن کاملA HYBRID ALGORITHM FOR THE OPEN VEHICLE ROUTING PROBLEM
The open vehicle routing problem (OVRP) is a variance of the vehicle routing problem (VRP) that has a unique character which is its open path form. This means that the vehicles are not required to return to the depot after completing service. Because this problem belongs to the NP-hard problems, many metaheuristic approaches like the ant colony optimization (ACO) have been used to solve OVRP in...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.06.332